Graph rewriting for a partial ordering semantics of concurrent constraint programming

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Graph Rewriting Semantics for Functional Programming Languages

The lambda calculus forms without any question *the* theoretical backbone of functional programming languages. For the design and implementation of the lazy functional language Concurrent Clean we have used a related computational model: Term Graph Rewriting Systems (TGRS's). This paper wraps up our main conclusions after 10 years of experience with graph rewriting semantics for functional prog...

متن کامل

Oracles and Connuence | a Fixpoint Semantics for Concurrent Constraint Programming

We consider the problem of giving a xpoint semantics for a parallel and non-deterministic programming language with fairness and arbitrary recur-sion, in which both nite and innnite computations are taken into account. We rst deene an operational semantics based on oracles ((nite and inn-nite strings over a countable alphabet), in which the non-deterministic choices are determined by the oracle...

متن کامل

A Banach Space Based Semantics for Probabilistic Concurrent Constraint Programming

The aim of this work is to provide a probabilistic foundation for nondeterministic computations in Concurrent Constraint Programming (CCP). Diierently from common approaches in (imperative) high-level programming languages, which rely on some kind of random() function, we introduce randomness in the very deenition of the language by means of a probabilistic choice construct. This allows a progr...

متن کامل

A Concurrent Operational Semantics for Constraint Functional Logic Programming

In this paper we describe a sound and complete concurrent operational semantics for constraint functional logic programming languages which allows to model declarative applications in which the interaction between demand-driven narrowing and constraint solving helps to prune the search space, leading to shorter goal derivations. We encode concurrency into the generic CFLP(D) scheme, a uniform f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 1993

ISSN: 0304-3975

DOI: 10.1016/0304-3975(93)90069-6